A Sudoku-based Secret Image Sharing Scheme with Reversibility (Invited Paper)

نویسندگان

  • Chin-Chen Chang
  • Pei-Yu Lin
  • Zhi-Hui Wang
  • Mingchu Li
چکیده

A common drawback of the image sharing with steganography approaches is that the revealed secret image is distorted due to the truncation of the grayscale secret image. To lossless reveal the secret image in the (t, n)threshold, we provide a novel sharing scheme in this article. Moreover, the original host image can be recovered by the embedded shadow images. To accomplish the above purposes, the proposed scheme derives the secret shadows and generates the meaningful shadow images by adopting the sudoku. In the new scheme, the sudoku grid is setting to 1616 and divided into sixteen 44 blocks. Thus, we can embed 4(t-1) secret bits into each pixel pair of the host image. Besides, the embeddable secret capacity can be improved according to the threshold t in the (t, n)-threshold sharing system. The experiments show that the shadows can be successfully camouflaged in the host image with satisfactory quality. The distortion of the embedded host pixels is limited within range [0, 3]. Moreover, the proposed scheme provides a large capacity for embedded secret data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

Sharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode

In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

متن کامل

On the design and security of a lattice-based threshold secret sharing scheme

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCM

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010